Multivalued logic gates for quantum computation
نویسندگان
چکیده
منابع مشابه
Multivalued logic gates for quantum computation
We develop a multivalued logic for quantum computing for use in multi-level quantum systems, and discuss the practical advantages of this approach for scaling up a quantum computer. Generalizing the methods of binary quantum logic, we establish that arbitrary unitary operations on any number of d-level systems (d .2) can be decomposed into logic gates that operate on only two systems at a time....
متن کاملEfficient implementation of coupled logic gates for quantum computation
Most natural Hamiltonians do not couple specific pairs of quantum bits and spurious couplings occur along with the intended one. We present an efficient scheme that couples any designated pair of spins in heteronuclear spin systems. The scheme is based on the existence of Hadamard matrices. For a system of n spins with pairwise coupling, the scheme concatenates cn intervals of system evolution ...
متن کاملElementary gates for quantum computation.
We show that a set of gates that consists of all one-bit quantum gates (U(2)) and the two-bit exclusive-or gate (that maps Boolean values (x, y) to (x, x⊕y)) is universal in the sense that all unitary operations on arbitrarily many bits n (U(2n)) can be expressed as compositions of these gates. We investigate the number of the above gates required to implement other gates, such as generalized D...
متن کاملElementary Gates for Quantum Computation
(quant-ph/9503007) 36] R. Landauer, \Is quantum mechanics useful?", Proc. Roy. Soc. Lond., (to be published). 37] The only non-trivial one-bit classical invertible operation is 0 1 1 0. 41] Corresponding with the deenition in the previous section, the top two wires contain the input bits x 1 and x 2 , and the third wire contains the input y). 42] The angle-halving of this deenition conforms to ...
متن کاملElementary Gates for Quantum Computation Tycho Sleator
We show that a set of gates that consists of all one-bit quantum gates (U(2)) and the two-bit exclusive-or gate (that maps Boolean values (x; y) to (x; xy)) is universal in the sense that all unitary operations on arbitrarily many bits n (U(2 n)) can be expressed as compositions of these gates. We investigate the number of the above gates required to implement other gates, such as generalized D...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2000
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.62.052309